Deep Neural Network Structures Solving Variational Inequalities
نویسندگان
چکیده
منابع مشابه
Double Projection Neural Network Model for Solving Pseudomonotone Variational Inequalities
In this paper we propose a novel double projection recurrent neural network model for solving pseudomonotone variational inequalities based on a technique of updating the state variable and fixed point theorem. This model is stable in the sense of Lyapunov and globally convergent for problems that satisfy Lipschitz continuity and pseudomonotonicity conditions. The global exponential stability o...
متن کاملSolving complementarity and variational inequalities problems using neural networks
In this paper, we propose a recurrent neural network model for solving a class of monotone variational inequalities problem with linear constraints. The neural network is stable in the sense of Lyapunov and globally convergent to an optimal solution. Compared with the existing convergence results, the present proof do not require Lipschitz continuity condition on the objective function. This ne...
متن کاملIterative Methods for Solving Trifunction Variational Inequalities
In this paper, we introduce and consider a class of variational inequalities, which is called the trifunction variational inequality. We use the auxiliary principle technique to suggest and analyze an implicit iterative methods for solving the trifunction variational inequalities. We study the convergence criteria of this new method under pseudomomotonicity condition, which is weaker condition ...
متن کاملOn Implicit Algorithms for Solving Variational Inequalities
This paper presents new implicit algorithms for solving the variational inequality and shows that the proposed methods converge under certain conditions. Some special cases are also discussed.
متن کاملSolving asymmetric variational inequalities via convex optimization
Using duality, we reformulate the asymmetric variational inequality (VI) problem over a conic region as an optimization problem. We give sufficient conditions for the convexity of this reformulation. We thereby identify a class of VIs that includes monotone affine VIs over polyhedra, which may be solved by commercial optimization solvers. © 2005 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Set-Valued and Variational Analysis
سال: 2020
ISSN: 1877-0533,1877-0541
DOI: 10.1007/s11228-019-00526-z